An improved ant colony optimisation heuristic for graph colouring
نویسندگان
چکیده
منابع مشابه
Niching for Ant Colony Optimisation
Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...
متن کاملAn Ant Algorithm for the Graph Colouring Problem
This paper describes an ant algorithm that colours graphs in an e cient way. First, we describe the graph colouring problem and the ant algorithm. We also present some results and propose a simple generalisation of the algorithm that might allow its application to other assignment problems. Finally, a short study of the algorithm operators explains its performance and shows that it may be seen ...
متن کاملAn Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current work, we focus on a widely studied abstraction of this problem, the 2-dimensional hydrophobic-polar (2D HP) protein folding problem. We present an improved version of our recently proposed Ant Colony Optimisation (ACO) algorithm for this -hard combi...
متن کاملCandidate Set Strategies for Ant Colony Optimisation
Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests t...
متن کاملAnt Colony Optimisation for Job Shop Scheduling
A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm’s implementation and performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.03.025